Algebraic structures for transitive closure
نویسندگان
چکیده
منابع مشابه
Parallel Transitive Closure and Point Location in Planar Structures
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(logn) running time using n= logn processors in the EREW PRAM mod...
متن کاملAlgebraic moment closure for population dynamics on discrete structures.
Moment closure on general discrete structures often requires one of the following: (i) an absence of short-closed loops (zero clustering); (ii) existence of a spatial scale; (iii) ad hoc assumptions. Algebraic methods are presented to avoid the use of such assumptions for populations based on clumps and are applied to both SIR and macroparasite disease dynamics. One approach involves a series o...
متن کاملHybrid Transitive Closure Algorithms
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms perform better than existing transitive closure algorithms, includmg matrix-based algorithms that divide a matrix into stripes or into square blocks, and graph-based algmtihms. This family of algorithms can be generalized to solve path problems and to solve problems in...
متن کاملTransitive-closure spanners
We define the notion of a transitive-closure spanner of a directed graph. Given a directed graph G = (V,E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in access control, property testing, and data structures, and properties ...
متن کاملEecient Transitive Closure Computation
We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1977
ISSN: 0304-3975
DOI: 10.1016/0304-3975(77)90056-1